Non-deterministic Characterisations

نویسنده

  • Cynthia Kop
چکیده

In this paper, we extend Jones’ result—that cons-free programming with kth-order data and a callby-value strategy characterises EXPTIME—to a more general setting, including pattern-matching and non-deterministic choice. We show that the addition of non-determinism is unexpectedly powerful in the higher-order setting. Nevertheless, we can obtain a non-deterministic parallel to Jones’ hierarchy result by appropriate restricting rule formation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Power of Non-determinism in Higher-Order Implicit Complexity - Characterising Complexity Classes Using Non-deterministic Cons-Free Programming

We investigate the power of non-determinism in purely functional programming languages with higher-order types. Specifically, we consider cons-free programs of varying data orders, equipped with explicit non-deterministic choice. Cons-freeness roughly means that data constructors cannot occur in function bodies and all manipulation of storage space thus has to happen indirectly using the call s...

متن کامل

On external presentations of infinite graphs

The vertices of a finite state system are usually a subset of the natural numbers. Most algorithms relative to these systems only use this fact to select vertices. For infinite state systems, however, the situation is different: in particular, for such systems having a finite description, each state of the system is a configuration of some machine. Then most algorithmic approaches rely on the s...

متن کامل

Deterministic Genericity for Polynomial Ideals

We consider several notions of genericity appearing in algebraic geometry and commutative algebra. Special emphasis is put on various stability notions which are defined in a combinatorial manner and for which a number of equivalent algebraic characterisations are provided. It is shown that in characteristic zero the corresponding generic positions can be obtained with a simple deterministic al...

متن کامل

The Theory of Stabilisation Monoids and Regular Cost Functions

We introduce the notion of regular cost functions: a quantitative extension to the standard theory of regular languages. We provide equivalent characterisations of this notion by means of automata (extending the nested distance desert automata of Kirsten), of history-deterministic automata (history-determinism is a weakening of the standard notion of determinism, that replaces it in this contex...

متن کامل

Treading a Fine Line: Characterisations and Impossibilities for Liberal Principles in Innitely-Lived Societies1

This paper extends the analysis of liberal principles in social choice recently proposed by Mariotti and Veneziani (2009a) to in…nitely-lived societies. First, some novel characterisations of inegalitarian leximax social welfare relations are derived based on the Individual Bene…t Principle (IBP), which incorporates a liberal, non-interfering view of society. This is surprising because the IBP ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1711.03415  شماره 

صفحات  -

تاریخ انتشار 2017